Stability Theory of Universal Learning Network

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Learning Theory

This encyclopedic article gives a mini-introduction into the theory of universal learning, founded by Ray Solomonoff in the 1960s and significantly developed and extended in the last decade. It explains the spirit of universal learning, but necessarily glosses over technical subtleties.

متن کامل

Statistical Learning Theory Lecture : 27 Universal Portfolios

Suppose we have m instruments (i.e. stocks). At each period of time t, we have wealth Vt, and we invest a proportion pt,i in each instrument i. Instrument i increases in value by a factor xt,i ≥ 0. Our capital at period t thus increases by a factor Vt Vt−1 = ∑ i xt,ipt,i = x ′ tpt. pt is in the simplex ∆m, and xt is a random m-dimensional vector. The first question to consider is: what is a fai...

متن کامل

Stability Results in Learning Theory

The problem of proving generalization bounds for the performance of learning algorithms can be formulated as a problem of bounding the bias and variance of estimators of the expected error. We show how various stability assumptions can be employed for this purpose. We provide a necessary and sufficient stability condition for bounding the bias and variance for the Empirical Risk Minimization al...

متن کامل

Distances and Stability in Biological Network Theory

In this thesis we introduce, define and quantitatively assess the stability of the algorithms for the reconstruction of networks. We will focus on theory, development and implementation of operative procedures and algorithms for the assessment of stability in complex networks for biological systems, with gene regulatory networks as the key example. A major issue affecting network inference is i...

متن کامل

Universal Algorithms for Learning Theory Part I : Piecewise Constant Functions

This paper is concerned with the construction and analysis of a universal estimator for the regression problem in supervised learning. Universal means that the estimator does not depend on any a priori assumptions about the regression function to be estimated. The universal estimator studied in this paper consists of a least-square fitting procedure using piecewise constant functions on a parti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems

سال: 1996

ISSN: 0385-4221,1348-8155

DOI: 10.1541/ieejeiss1987.116.8_973